Time Dependent Heterogeneous Vehicle Routing Problem for Catering Service Delivery Problem
نویسندگان
چکیده
منابع مشابه
A Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet
Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...
متن کاملA time-dependent vehicle routing problem for disaster response phase in multi-graph-based network
Logistics planning in disaster response phase involves dispatching commodities such as medical materials, personnel, food, etc. to affected areas as soon as possible to accelerate the relief operations. Since transportation vehicles in disaster situations can be considered as scarce resources, thus, the efficient usage of them is substantially important. In this study, we provide a dynamic vehi...
متن کاملA Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost
This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...
متن کاملTHE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS
The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...
متن کاملa comparison of nsga ii and mosa for solving multi-depots time-dependent vehicle routing problem with heterogeneous fleet
time-dependent vehicle routing problem is one of the most applicable but least-studied variants of routing and scheduling problems. in this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. to deal with the traffic congestions, we also considered that the vehicles are not forced to come...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2017
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/890/1/012103